graph structure造句
例句與造句
- Structure does not map naturally to the object graph structure of serialization , and vice versa
結(jié)構(gòu)并不能自然地映射到序列化的對象圖結(jié)構(gòu)，反之亦然。 - Because graph structure has powerful ability of data representation , it has been widely used in many aspects
由于圖結(jié)構(gòu)具有強(qiáng)大的表示能力,它在許多方面有著廣泛的應(yīng)用。 - Graphplan was the first planner which using the high efficiency planning graph structure in planner design
圖規(guī)劃首次將規(guī)劃圖應(yīng)用于規(guī)劃器設(shè)計。規(guī)劃圖的高度并行性使得規(guī)劃器求解效率有了質(zhì)的飛躍。 - 2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4 . 5 ]
( 2 )證明了布爾環(huán)上的一類可逆線性內(nèi)動機(jī)的圖型與其仿射內(nèi)動機(jī)的圖型相同定理4 . 5 。 - 34 sun y f , chen h . gsfc : the storage of free cube based on graph structure . journal of computer research and development , 2004 , 41 : 1652 - 1660
本文簡介了我們在立方體計算技術(shù)方面的若干創(chuàng)新研究成果，以及開發(fā)的并行數(shù)據(jù)倉庫和聯(lián)機(jī)分析系統(tǒng)paraware 。 - It's difficult to find graph structure in a sentence. 用graph structure造句挺難的
- 3 . the graph structure of some non - invertible autonomous automata is discussed in regular space , orthogonal space , and orthonormal space respectively . some new results are derived [ theorem 3 . 10 - 3 . 13 ]
( 3 )討論了非可逆線性內(nèi)動機(jī)在正規(guī)空間、直交空間、正交空間上的圖型結(jié)構(gòu)問題[定理3 . 10 3 . 13 ] 。 - We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact - equibranch down - oriented - tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4 . 1 - 4 . 4 ]
本文研究了有限布爾環(huán)上的內(nèi)動機(jī)圖型結(jié)構(gòu)，取得了下列成果: ( 1 )定出了布爾環(huán)上的一類具有等叉下向樹形的線性內(nèi)動機(jī)和一類可逆線性內(nèi)動機(jī)的圖型定理4 . 1 ~ 4 . 4 ] 。 - The computational cost involved no longer increases exponentially with the number of vertices of the meshes to be fused . ( 2 ) the algorithm is robust as the ambiguity in graph structure combination is alleviated . ( 3 ) the detail of the cut mesh is fully kept
與原有的基于全局調(diào)和映射的融合方法相比，新方法具有以下優(yōu)點(diǎn)： ( 1 )算法效率大幅度提升，求解時間不再隨融合模型頂點(diǎn)數(shù)的增加而指數(shù)增長； ( 2 )減少了二維網(wǎng)格拓?fù)浜喜⒅衅娈惽闆r出現(xiàn)的概率，提高了算法的穩(wěn)定性； ( 3 )被剪切網(wǎng)格的細(xì)節(jié)得到完整保留； ( 4 )消除了原算法對融合區(qū)域拓?fù)涞南拗啤? - 3 ) presentation and implementation of key - based relational schema reverse reconstruction algorithm ( krr ) . based on discrete mathematics theory , a krr algorithm is proposed which can realize the transformation from relational schema to directed graph structure and get a good data preparation for the sequential schema mapping
3 )提出基于key的關(guān)系模式重構(gòu)算法以離散數(shù)學(xué)理論為基礎(chǔ)，對關(guān)系模式數(shù)學(xué)建模，通過提出基于key的關(guān)系模式重構(gòu)算法，將關(guān)系模式轉(zhuǎn)化為有向圖數(shù)據(jù)結(jié)構(gòu)，為模式映射提供基礎(chǔ)。